Quantum Error Correction Protocols Research Articles

High-threshold and low-overhead fault-tolerant quantum memory

The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

Silicon spin qubit noise characterization using real-time feedback protocols and wavelet analysis

Recently, several groups have demonstrated two-qubit gate fidelities in semiconductor spin qubit systems above 99%. Achieving this regime of fault-tolerant compatible high fidelities is nontrivial and requires exquisite stability and precise control over the different qubit parameters over an extended period of time. This motivates the search for the efficient calibration of qubit control parameters against different sources of micro- and macroscopic noise and methods for noise analysis. Here, we present several single- and two-qubit parameter feedback protocols, optimized for and implemented in the state-of-the-art fast field-programmable gate array hardware. Furthermore, we present a wavelet-based analysis on feedback data collected over a ∼9 h time frame to gain insight into the different sources of noise in the system. Scalable feedback is an outstanding challenge and the presented implementation and analysis gives insight into the benefits and drawbacks of qubit parameter feedback, as feedback related overhead increases. This work demonstrates a pathway toward robust qubit parameter feedback and systematic noise analysis, crucial for mitigation strategies toward systematic high-fidelity qubit operation compatible with quantum error correction protocols.

Quantum Complementarity Approach to Device-Independent Security.

Complementarity is an essential feature of quantum mechanics. The preparation of an eigenstate of one observable implies complete randomness in its complementary observable. In quantum cryptography, complementarity allows us to formulate security analyses in terms of phase-error correction. However, the concept becomes much subtler in the device-independent regime that offers security without device characterization. Security proofs of device-independent quantum cryptography tasks are often complex and quite different from those of their more standard device-dependent cousins. The existing proofs pose huge challenges to experiments, among which large data-size requirement is a crux. Here, we show the complementarity security origin of the device-independent tasks. By linking complementarity with quantum nonlocality, we recast the device-independent scheme into a quantum error correction protocol. Going beyond the identical-and-independent-distribution case, we consider the most general attack. We generalize the sample entropy in classical Shannon theory for the finite-size analysis. Our method exhibits good finite-size performance and brings the device-independent scheme to a more practical regime. Applying it to the data in a recent ion-trap-based device-independent quantum key distribution experiment, one could reduce the requirement on data size to less than a third. Furthermore, the operational meaning of complementarity naturally extends device-independent scenarios to advantage key distillation, easing experiments by tolerating higher loss and lower transmittance.

A cellular automaton decoder for a noise-bias tailored color code

Self-correcting quantum memories demonstrate robust properties that can be exploited to improve active quantum error-correction protocols. Here we propose a cellular automaton decoder for a variation of the color code where the bases of the physical qubits are locally rotated, which we call the XYZ color code. The local transformation means our decoder demonstrates key properties of a two-dimensional fractal code if the noise acting on the system is infinitely biased towards dephasing, namely, no string-like logical operators. As such, in the high-bias limit, our local decoder reproduces the behavior of a partially self-correcting memory. At low error rates, our simulations show that the memory time diverges polynomially with system size without intervention from a global decoder, up to some critical system size that grows as the error rate is lowered. Furthermore, although we find that we cannot reproduce partially self-correcting behavior at finite bias, our numerics demonstrate improved memory times at realistic noise biases. Our results therefore motivate the design of tailored cellular automaton decoders that help to reduce the bandwidth demands of global decoding for realistic noise models.

Fusion-based quantum computation

The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.

Characterizing Quantum Instruments: From Nondemolition Measurements to Quantum Error Correction

In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Due to the information gain of classical measurement outputs non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states. Here we present a general recipe to characterize quantum instruments alongside its experimental implementation and analysis. Thereby, the full dynamics of a quantum instrument can be captured, exhibiting details of the quantum dynamics that would be overlooked with common tomography techniques. For illustration, we apply our characterization technique to a quantum instrument used for the detection of qubit loss and leakage, which was recently implemented as a building block in a quantum error correction (QEC) experiment (Nature 585, 207-210 (2020)). Our analysis reveals unexpected and in-depth information about the failure modes of the implementation of the quantum instrument. We then numerically study the implications of these experimental failure modes on QEC performance, when the instrument is employed as a building block in QEC protocols on a logical qubit. Our results highlight the importance of careful characterization and modelling of failure modes in quantum instruments, as compared to simplistic hardware-agnostic phenomenological noise models, which fail to predict the undesired behavior of faulty quantum instruments. The presented methods and results are directly applicable to generic quantum instruments.

Narrow-line imaging of single strontium atoms in shallow optical tweezers

Single strontium atoms held in optical tweezers have so far only been imaged using the broad ${}^{1}{S}_{0}{\text{\ensuremath{-}}}^{1}{P}_{1}\phantom{\rule{0.16em}{0ex}}$transition. For Yb, use of the narrow (183-kHz wide) ${}^{1}{S}_{0}{\text{\ensuremath{-}}}^{3}{P}_{1}\phantom{\rule{0.16em}{0ex}}$transition for simultaneous imaging and cooling has been demonstrated in tweezers with a magic wavelength for the imaging transition. We demonstrate high-fidelity imaging of single Sr atoms using its even narrower (7.4-kHz wide) ${}^{1}{S}_{0}{\text{\ensuremath{-}}}^{3}{P}_{1}\phantom{\rule{0.16em}{0ex}}$transition. The atoms are trapped in nonmagic-wavelength tweezers. We detect the photons scattered during Sisyphus cooling, thus keeping the atoms near the motional ground state of the tweezer throughout imaging. The fidelity of detection is 0.9991(4) with a survival probability of 0.97(2). An atom in a tweezer can be held under imaging conditions for 79(3) seconds allowing for hundreds of images to be taken, limited mainly by background gas collisions. The use of a fully closed (cycling) transition for imaging will provide a useful tool for state specific detection. We detect atoms in an array of 36 tweezers with 813.4-nm light and trap depths of 135(20) $\ensuremath{\mu}$K. This trap depth is three times shallower than typically used for imaging on the broad ${}^{1}{S}_{0}{\text{\ensuremath{-}}}^{1}{P}_{1}\phantom{\rule{0.16em}{0ex}}$transition. Narrow-line imaging opens the possibility to even further reduce this trap depth, as long as all trap frequencies are kept larger than the imaging transition linewidth. Imaging using a narrow-linewidth transition in a nonmagic-wavelength tweezer also allows for selective imaging of a given tweezer. As a demonstration, we selectively image (hide) a single tweezer from the array. This provides a useful tool for quantum error correction protocols.

High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits

The development of noisy intermediate-scale quantum (NISQ) devices has extended the scope of executable quantum circuits with high-fidelity single- and two-qubit gates. Equipping NISQ devices with three-qubit gates will enable the realization of more complex quantum algorithms and efficient quantum error correction protocols with reduced circuit depth. Several three-qubit gates have been implemented for superconducting qubits, but their use in gate synthesis has been limited due to their low fidelity. Here, using fixed-frequency superconducting qubits, we demonstrate a high-fidelity iToffoli gate based on two-qubit interactions, the so-called cross-resonance effect. As with the Toffoli gate, this three-qubit gate can be used to perform universal quantum computation. The iToffoli gate is implemented by simultaneously applying microwave pulses to a linear chain of three qubits, revealing a process fidelity as high as 98.26(2)%. Moreover, we numerically show that our gate scheme can produce additional three-qubit gates which provide more efficient gate synthesis than the Toffoli and iToffoli gates. Our work not only brings a high-fidelity iToffoli gate to current superconducting quantum processors but also opens a pathway for developing multi-qubit gates based on two-qubit interactions.

The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors.

We introduce a Xilinx RF System-on-Chip (RFSoC)-based qubit controller (called the Quantum Instrumentation Control Kit, or QICK for short), which supports the direct synthesis of control pulses with carrier frequencies of up to 6GHz. The QICK can control multiple qubits or other quantum devices. The QICK consists of a digital board hosting an RFSoC field-programmable gate array, custom firmware, and software and an optional companion custom-designed analog front-end board. We characterize the analog performance of the system as well as its digital latency, important for quantum error correction and feedback protocols. We benchmark the controller by performing standard characterizations of a transmon qubit. We achieve an average gate fidelity of Favg=99.93%. All of the schematics, firmware, and software are open-source.

Trapped-Ion Quantum Computer with Robust Entangling Gates and Quantum Coherent Feedback

Quantum computers are expected to achieve a significant speed-up over classical computers in solving a range of computational problems. Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum computers, due to their long coherence times and high quality of control. Here we report on the construction of a small, five-qubit, universal quantum computer using $^{88}\text{Sr}^{+}$ ions in an RF trap. All basic operations, including initialization, quantum logic operations, and readout, are performed with high fidelity. Selective two-qubit and single-qubit gates, implemented using a narrow linewidth laser, comprise a universal gate set, allowing realization of any unitary on the quantum register. We review the main experimental tools, and describe in detail unique aspects of the computer: the use of robust entangling gates and the development of a quantum coherent feedback system through EMCCD camera acquisition. The latter is necessary for carrying out quantum error correction protocols in future experiments.

Fault-Tolerant Parity Readout on a Shuttling-Based Trapped-Ion Quantum Computer

Quantum error correction requires the detection of errors by reliable measurements of suitable multi-qubit correlation operators. Here, we experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. An additional 'flag' qubit serves to detect errors occurring throughout the parity measurement, which would otherwise proliferate into uncorrectable weight-2 errors on the qubit register. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)\%. Deliberately injecting bit and phase-flip errors, we show that the fault-tolerant protocol is capable of reliably intercepting such faults. For holistic benchmarking of the parity measurement scheme, we use entanglement witnessing to show that the implemented circuit generates genuine six-qubit multi-partite entanglement. The fault-tolerant parity measurement scheme is an essential building block in a broad class of stabilizer quantum error correction protocols, including topological color codes. Our hardware platform is based on atomic ions stored in a segmented microchip ion trap. The qubit register is dynamically reconfigured via shuttling operations, enabling effective full connectivity without operational cross-talk, which provides key capabilities for scalable fault-tolerant quantum computing.

Emerging Technologies for Quantum Computing

Despite promising proof of concept demonstrations, currently available quantum hardware suffers from fundamental scalability limitations. The field is relatively new and it is imperative to consider emerging technologies in the space and evaluate their unique tradeoff spaces to determine how to best close the gap between current devices and target applications. Here, we explore three recent developments on this front. First, we consider extensions to currently available hardware, which allow the use of higher level states, beyond the usual binary, which when used temporarily can confer circuit-level advantage. Second, we consider the use of superconducting resonant cavities to reduce hardware requirements to implement quantum error correction protocols. Finally, we consider the use of neutral atoms, which offer unique strengths and weaknesses. It is valuable to evaluate new technology early and often to determine the best path toward scalability.

Entropy analysis of the discrete-time quantum walk under bit-flip noise channel

We study the behavior of tunable one-dimensional discrete-time quantum walk (DTQW) in the presence of decoherence modeled by the flip-bit noise channel. By varying the noise intensity, we obtain a wide range of probability distributions of noisy walks, which can be loosely characterized as pure quantum walk, quantum-like walk, semi-classical like walk, and classical-like walk. We show the maximum Shannon entropy of the walk is not obtained under maximum decoherence, but instead at a lower degree of decoherence. This result may be useful for the implementation of quantum error correction, quantum cryptography, and quantum communication protocol, where one might expect the qubit internal state to be flipped due to noise.

Efficiently computing logical noise in quantum error-correcting codes

Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behavior of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We also derive general methods for reducing the computational complexity of calculating the exact effective logical noise by many orders of magnitude. This reduction is achieved by determining when different recovery operations produce equivalent logical noise. These methods could also be used to better approximate soft decoding schemes for concatenated codes or to reduce the size of a lookup table to speed up the error correction step in implementations of quantum error-correcting codes. We give examples of such reductions for the three-qubit, five-qubit, Steane, concatenated, and toric codes.

Detecting the event of a single photon loss on quantum signals

We design a scheme for detecting a single photon loss from multi-modal quantum signals transmitted via a fiber or in free space. This consists of a special type of unitary coding transformation, the parity controlled-squeezing, applied prior to the transmission on the signal composed by information and ancilla modes. At the receiver, the inverse unitary transformation is applied—decoding, and the ancilla mode is measured via photon detection. The outcome reveals whether a photon loss has occurred. Distortion of the information part of the signal caused by an ancilla photon loss can be corrected via unitary transformation while loss of a photon from the information part of the signal can be detected with the probability exponentially close to unity but cannot be corrected. In contrast to the schemes of decoherence free subspaces and quantum error correction protocols, this method allows one to make use in principle of entire Hilbert space dimensionality. We discuss possible ways of synthesizing the required encoding–decoding transformation.

Continuous quantum error correction for evolution under time-dependent Hamiltonians

We develop a protocol for continuous operation of a quantum error correcting code for protection of coherent evolution due to an encoded Hamiltonian against environmental errors, using the three-qubit bit-flip code and bit-flip errors as a canonical example. To detect errors in real time, we filter the output signals from continuous measurement of the error syndrome operators and use a double thresholding protocol for error diagnosis, while correction of errors is done as in the conventional operation. We optimize our continuous operation protocol for evolution under quantum memory and under quantum annealing, by maximizing the fidelity between the target and actual logical states at a specified final time. In the case of quantum memory, we show that our continuous operation protocol yields a logical error rate that is slightly larger than the one obtained from using the optimal Wonham filter for error diagnosis while being simpler to implement. For quantum annealing, we show that our continuous quantum error correction protocol can significantly reduce the final logical state infidelity when the continuous measurements are sufficiently strong relative to the strength of the time-dependent Hamiltonian. We also show that this continuous quantum error correction protocol can reduce the time-to-solution relative to the value obtained from a classical parallelization scheme. These results suggest that a continuous implementation is suitable for quantum error correction in the presence of encoded time-dependent Hamiltonians, opening the possibility of many applications in quantum simulation and quantum annealing.

Asymptotic Theory of Quantum Channel Estimation

The quantum Fisher information (QFI), as a function of quantum states, measures the amount of information that a quantum state carries about an unknown parameter. The (entanglement-assisted) QFI of a quantum channel is defined to be the maximum QFI of the output state assuming an entangled input state over a single probe and an ancilla. In quantum metrology, people are interested in calculating the QFI of N identical copies of a quantum channel when N→∞, which is called the asymptotic QFI. Over the years, researchers found various types of upper bounds of the asymptotic QFI, but they were proven achievable only in several specific situations. It was known that the asymptotic QFI of an arbitrary quantum channel grows either linearly or quadratically with N. Here we show that a simple criterion can determine whether the scaling is linear or quadratic. In both cases, the asymptotic QFI and a quantum error correction protocol to achieve it are computable via a semidefinite program. When the scaling is quadratic, the Heisenberg limit, a feature of noiseless quantum channels, is recovered. When the scaling is linear, we show that the asymptotic QFI is still in general larger than N times the single-channel QFI and, furthermore, that sequential estimation strategies provide no advantage over parallel ones.Received 23 March 2020Revised 20 December 2020Accepted 26 February 2021DOI:https://doi.org/10.1103/PRXQuantum.2.010343Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasQuantum error correctionQuantum metrologyQuantum sensingQuantum Information

Designed polynuclear lanthanide complexes for quantum information processing.

The design of dissymmetric organic ligands featuring combinations of 1,3-diketone and 2,6-diacetylpyridine coordination pockets has been exploited to produce dinuclear and trinuclear lanthanide-based coordination compounds. These molecules exhibit two or more non-equivalent Ln ions, most remarkably enabling the access to well-defined heterolanthanide compositions. The site-selective disposition of each metal ion within the molecular entities allows the study of each centre individually as a spin-based quantum bit, affording unparalleled versatility for quantum gate design. The inherent weak interaction between the Ln ions permits the performance of multi-qubit quantum logical operations realized through their derived magnetic states, or implementing quantum-error correction protocols. The different studies performed to date on these systems are revised, showing their vast potential within spin-based quantum information processing.

Memory-assisted decoder for approximate Gottesman-Kitaev-Preskill codes

We propose a quantum error correction protocol for continuous-variable finite-energy, approximate Gottesman-Kitaev-Preskill (GKP) states undergoing small Gaussian random displacement errors, based on the scheme of Glancy and Knill [Phys. Rev. A {\bf 73}, 012325 (2006)]. We show that combining multiple rounds of error-syndrome extraction with Bayesian estimation offers enhanced protection of GKP-encoded qubits over comparible single-round approaches. Furthermore, we show that the expected total displacement error incurred in multiple rounds of error followed by syndrome extraction is bounded by $2\sqrt{\pi}$. By recompiling the syndrome-extraction circuits, we show that all squeezing operations can be subsumed into auxiliary state preparation, reducing them to beamsplitter transformations and quadrature measurements.

Wigner distribution on a double-cylinder phase space for studying quantum error-correction protocols

We introduce a quasi-probability phase space distribution with two pairs of azimuthal-angular coordinates. This representation is well adapted to describe quantum systems with discrete symmetry. Quantum error correction of states encoded in continuous variables using translationally invariant states is studied as an example of application. We also propose an experimental scheme for measuring such new distribution.